A note on multiple coverings of the farthest-off points

In this work we summarize some recent results, to be included in a forthcoming paper [1]. We define μ-density as a characteristic of quality for the kind of coverings codes called multiple coverings of the farthest-off points (MCF). A concept of multiple saturating sets ((ρ, μ)-saturating sets) in projective spaces PG(N, q) is introduced. A fundamental relationship of these sets with MCF is showed. Bounds for the smallest possible cardinality of (1, μ)-saturating sets are obtained. Constructions of small (1, μ)-saturating sets improving the probabilistic bound are proposed.